Programming Research Group Probabilistic Detreminism Probabilistic Determinism

نویسنده

  • Annabelle McIver
چکیده

In 3] a probabilistic space PCSP of processes is constructed uniformly from the standard CSP failures-divergences model. Here we identify the deterministic (probabilistic) elements of PCSP as the maximal elements in the reenement ordering. We extend the standard characterisation of deterministic processes in terms of of properties of their nite approximations, and formulate some analogues of the standard syntactic rules for ensuring determinism.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Probabilistic-Risky Programming Models in Identifying Optimized Pattern of Cultivation under Risk Conditions (Case Study: Shoshtar Region)

Using Telser and Kataoka models of probabilistic-risky mathematical programming, the present research is to determine the optimized pattern of cultivating the agricultural products of Shoshtar region under risky conditions. In order to consider the risk in the mentioned models, time period of agricultural years 1996-1997 till 2004-2005 was taken into account. Results from Telser and Kataoka mod...

متن کامل

Monad Combinators, Non-Determinism and Probabilistic Choice

We test Lüth and Ghani’s proposal [11, 12, 13] to use coproducts of monads as a basis for modularity by applying their ideas to Varacca’s work [20] on combining non-determinism and probabilistic choice. In particular, we discuss i) the coproduct of non-determinism and probabilistic choice; ii) how monad compositions based upon distributivity possess a universal property; and iii) Capretta’s [4]...

متن کامل

A Unification of Probablilistic Choice within a Design-based Model of Reversible Computation University of Teesside Formal Methods and Programming Research Group

We see reversible computing as a generalisation of sequential computation obtained by revoking the law of the excluded miracle. Our execution language includes naked guarded commands and non-deterministic choice. Choices which lead to miraculous continuations invoke reverse computation, and non-deterministic choice plays the rôle of provisional choice within a backtracking context. We require p...

متن کامل

Probabilistic Normed Groups

In this paper, we introduce the  probabilistic normed groups. Among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. We also study midconvex functions defined  on probabilistic normed groups and  give  some results about locally boundedness of such  functions.

متن کامل

Support vector regression with random output variable and probabilistic constraints

Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007